POPMUSIC for the world location-routing problem
نویسندگان
چکیده
منابع مشابه
Popmusic for the World Location Routing Problem
ABSTRACT. POPMUSIC — Partial optimization metaheuristic under special intensification conditions — is a template for tackling large problem instances. This template has been shown to be very efficient for various combinatorial problems like p-median, sum of squares clustering, vehicle routing and map labeling. In terms of algorithmic complexity, one of the most complex part of POPMUSIC template...
متن کاملPopMusic for Real World Large Scale Multi Depot Vehicle Routing Problem with Time Windows
In this paper we consider a large scale Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) that was derived from a large Austrian logistics provider. The developed algorithm is based on the PopMusic framework developed by Taillard and Voss [2] and uses a specially designed Memetic Algorithm (MA) as optimizer. The MA was chosen as it is easy to be integrated into the framework as we...
متن کاملPOPMUSIC for a real-world large-scale vehicle routing problem with time windows
This paper presents a heuristic approach based on the POPMUSIC framework for a large scale Multi Depot Vehicle Routing Problem with Time Windows (MDVRPTW) derived from real world data. Popmusic is a very powerful tool for tackling large problem instances. A Memetic Algorithm (MA) is used as an optimiser in the Popmusic framework. It is shown that a population based search combined with decompos...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Latency Location-Routing Problem
This paper introduces the Latency Location-Routing Problem (LLRP) whose goal is to minimize waiting time of recipients by optimally determining both the locations of depots and the routes of vehicles. The LLRP is customer oriented by pursuing minimization of the latency instead of minimization of the length of routes. One of the main applications of this problem is the distribution of supplies ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Transportation and Logistics
سال: 2013
ISSN: 2192-4376,2192-4384
DOI: 10.1007/s13676-013-0024-2